全文获取类型
收费全文 | 889篇 |
免费 | 38篇 |
国内免费 | 32篇 |
专业分类
化学 | 5篇 |
力学 | 18篇 |
综合类 | 12篇 |
数学 | 917篇 |
物理学 | 7篇 |
出版年
2023年 | 6篇 |
2022年 | 4篇 |
2021年 | 9篇 |
2020年 | 14篇 |
2019年 | 15篇 |
2018年 | 19篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 19篇 |
2014年 | 24篇 |
2013年 | 49篇 |
2012年 | 77篇 |
2011年 | 22篇 |
2010年 | 28篇 |
2009年 | 43篇 |
2008年 | 44篇 |
2007年 | 49篇 |
2006年 | 50篇 |
2005年 | 48篇 |
2004年 | 35篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 38篇 |
2000年 | 25篇 |
1999年 | 24篇 |
1998年 | 20篇 |
1997年 | 20篇 |
1996年 | 13篇 |
1995年 | 14篇 |
1994年 | 17篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 10篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有959条查询结果,搜索用时 15 毫秒
71.
群体多目标决策联合有效解类的不变凸充分条件 总被引:2,自引:0,他引:2
对于群体多目标决策问题,文[1]引进它的联合有效解类的概念,并给出这类解的最优性必要条件,在对于问题的目标函数和约束函数附加凸性的条件下,文[2]又给出了联合有效解类的最优性充分条件,本文进一步在目标函数和约束函数具不变凸和不变广义 凸的情况下,分别给出了联合有效解类的若干最优性充分条件。 相似文献
72.
Kotarski W.; El-Saify H. A.; Bahaa G. M. 《IMA Journal of Mathematical Control and Information》2002,19(4):461-476
A distributed control problem for the parabolic operator withan infinite number of variables and time delay is considered.The performance index has an integral form. Constraints on controlsare imposed. To obtain optimality conditions for the Neumannproblem, the generalization of the DubovitskiiMilyutintheorem given by Walczak in WALCZAK, S. Folia Mathematics, 1,187196 and WALCZAK, S. J. Optim. Theory Appl., 42, 561582was applied. 相似文献
73.
This article is concerned with second-order necessary and sufficient optimality conditions for optimal control problems governed by 3-dimensional Navier-Stokes equations. The periodic state constraint is considered. 相似文献
74.
We consider the class of saturated main effect plans for the 2k factorial. With these saturated designs, the overall mean and all main effects can be unbiasedly estimated provided that there are no interactions. However, there is no way to estimate the error variance with such designs. Because of this and other reasons, we like to add some additional runs to the set of (k+1) runs in the D‐optimal design in this class. Our goals here are: (1) to search for s additional runs so that the resulting design based on (k+s+1) runs yields a D‐optimal design in the class of augmented designs; (2) to classify all the runs into equivalent classes so that the runs in the same equivalent class give us the same value of the determinant of the information matrix. This allows us to trade runs for runs if this becomes necessary; (3) to obtain upper bounds for determinant of the information matrices of augmented designs. In this article we shall address these approaches and present some new results. © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 51–77, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10026 相似文献
75.
Military course of action planning involves time and space synchronization as well as resource and asset allocation. A mission could be seen as a defined set of logical ordered tasks with time and space constraints. The resources to task rules require that available assets should be allocated to each task. A combination of assets might be required to execute a given task. The couple (task, resources) constitutes an action. This problem is formulated as a multi-objectives scheduling and resource allocation problem. Any solution is assessed based on a number of conflicting and heterogeneous objectives. In fact, military planning officers should keep perfecting the plan based on the Commander’s criteria for success. The scheduling problem and resource allocation problem are considered as NP-Hard Problems [A. Guitouni, B. Urli, J.-M. Martel, Course of action planning: A project based modelling, Working Paper, Faculté des sciences de l’ administration, Université Laval, Québec, 2005]. This paper is concerned with the multi-objectives resource allocation problem. Our objective is to find adequate resource allocation for given courses of action schedule. To optimize this problem, this paper investigates non-exact solution methods, like meta-heuristic methods for finding potential efficient solutions. A progressive resource allocation methodology is proposed based on Tabu Search and multi-objectives concepts. This technique explores the search space so as to find a set of potential efficient solutions without aggregating the objectives into a single objective function. It is guided by the principle of maximizing the usage of any resource before considering a replacement resource. Thus, a given resource is allocated to the maximum number of tasks for a given courses of action schedule. A good allocation is a potential efficient solution. These solutions are retained by applying a combination of a dominance rule and a multi-criteria filtering method. The performance of the proposed Pareto-based approach is compared to two aggregation approaches: weighted-sum and the lexicographic techniques. The result shows that a Pareto-based approach is providing better solutions and allowing more flexibility to the decision-maker. 相似文献
76.
H. Tuy 《Journal of Optimization Theory and Applications》2003,118(1):201-216
We discuss global optimality conditions and cutting plane algorithms for DC optimization. The discussion is motivated by certain incorrect results that have appeared recently in the literature on these topics. Incidentally, we investigate the relation of the Tikhonov reciprocity theorem to the optimality conditions for general nonconvex global optimization problems and show how the outer-approximation scheme developed earlier for DC programming can be used to solve a wider class of problems. 相似文献
77.
A. Arutyunov V. Dykhta F. Lobo Pereira 《Journal of Optimization Theory and Applications》2005,124(1):55-77
First-order and second-order necessary conditions of optimality for an impulsive control problem that remain informative for abnormal control processes are presented and derived. One of the main features of these conditions is that no a priori normality assumptions are required. This feature follows from the fact that these conditions rely on an extremal principle which is proved for an abstract minimization problem with equality constraints, inequality constraints, and constraints given by an inclusion in a convex cone. Two simple examples illustrate the power of the main result.The first author was partially supported by the Russian Foundation for Basic Research Grant 02-01-00334. The second author was partially supported by the Russian Foundation for Basic Research Grant 00-01-00869. The third author was partially supported by Fundacao para a Ciencia e Tecnologia and by INVOTAN Grant. 相似文献
78.
In this paper, we establish global necessary and sufficient optimality conditions for D.C. vector optimization problems under
reverse convex constraints. An application to vector fractional mathematical programming is also given.
Mathematics Subject Classifications (1991). Primary 90C29, Secondary 49K30. 相似文献
79.
王立春 《数学物理学报(A辑)》2006,26(6):938-947
该文运用经验贝叶斯(empirical Bayes(简称EB))方法,在历史样本和当前样本均被另一个具有未知分布的变量随机右删失的条件下,构造了一个指数分布参数的经验贝叶斯估计并获得了它的渐近最优性.文章最后给出了一个例子和模拟结果. 相似文献
80.
S. Ya. Serovaiskii 《Mathematical Notes》2006,80(5-6):833-847
We consider the optimal control problem for systems described by nonlinear equations of elliptic type. If the nonlinear term in the equation is smooth and the nonlinearity increases at a comparatively low rate of growth, then necessary conditions for optimality can be obtained by well-known methods. For small values of the nonlinearity exponent in the smooth case, we propose to approximate the state operator by a certain differentiable operator. We show that the solution of the approximate problem obtained by standard methods ensures that the optimality criterion for the initial problem is close to its minimal value. For sufficiently large values of the nonlinearity exponent, the dependence of the state function on the control is nondifferentiable even under smoothness conditions for the operator. But this dependence becomes differentiable in a certain extended sense, which is sufficient for obtaining necessary conditions for optimality. Finally, if there is no smoothness and no restrictions are imposed on the nonlinearity exponent of the equation, then a smooth approximation of the state operator is possible. Next, we obtain necessary conditions for optimality of the approximate problem using the notion of extended differentiability of the solution of the equation approximated with respect to the control, and then we show that the optimal control of the approximated extremum problem minimizes the original functional with arbitrary accuracy. 相似文献